Hyperedge Replacement, Graph Grammars
نویسندگان
چکیده
In this survey the concept of hyperedge replacement is presented as an elementary approach to graph and hypergraph generation. In particular, hyperedge replacement graph grammars are discussed as a (hyper)graph-grammatical counterpart to context-free string grammars. To cover a large part of the theory of hyperedge replacement, structural properties and decision problems, including the membership problem, are addressed.
منابع مشابه
From Hyperedge Replacement to Separation Logic and Back
Hyperedge-replacement grammars and separation-logic formulas both define classes of graph-like structures. In this paper, we relate the different formalisms by effectively translating restricted hyperedge-replacement grammars into formulas of a fragment of separation-logic with recursive predicates, and vice versa. The translations preserve the classes of specified graphs, and hence the two app...
متن کاملHyperedge Replacement and Nonprojective Dependency Structures
Synchronous Hyperedge Replacement Graph Grammars (SHRG) can be used to translate between strings and graphs. In this paper, we study the capacity of these grammars to create non-projective dependency graphs. As an example, we use languages that contain cross serial dependencies. Lexicalized hyperedge replacement grammars can derive string languages (as path graphs) that contain an arbitrary num...
متن کاملFrom Separation Logic to Hyperedge Replacement and Back
Hyperedge replacement grammars and separation-logic formulas both define classes of graph-like structures. In this paper, we describe two effective translations between restricted hyperedge replacement grammars and formulas in a fragment of separation logic. These translations preserve the semantics of formulas and grammars. Hyperedge-replacement grammars [1] are a natural extension of context-...
متن کاملDecidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement
Habel, A., H.-J. Kreowski and W. Vogler, Decidable boundedness problems for sets of graphs generated by hyperedge-replacement, Theoretical Computer Science 89 (1991) 33-62. Consider a class GZ of hyperedge-replacement graph grammars and a numeric function on graphs like the number of edges, the degree (i.e., the maximum of the degrees of all nodes of a graph), the number of simple paths, the si...
متن کاملContextual Hyperedge Replacement Grammars for Abstract Meaning Representations
We show how contextual hyperedge replacement grammars can be used to generate abstract meaning representations (AMRs), and argue that they are more suitable for this purpose than hyperedge replacement grammars. Contextual hyperedge replacement turns out to have two advantages over plain hyperedge replacement: it can completely cover the language of all AMRs over a given domain of concepts, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997